A Scalable Relational Database Approach for WebService Matchmaking
نویسندگان
چکیده
Web services have a potential to enhance Business to Business collaboration by exposing compatible services to a service of higher dimension. Composition of web services essentially requires matching of their conversation protocols in addition to service requirements. For modeling and matching of conversations, the usability of formal structure like Finite State Machine (FSM) is well studied. However we are in opinion that for storing FSMs in graphs and retrieving them is not scalable for high cost in terms of memory and time. As in near future, as millions of web services will be available this scalability problem is a challenge to research communities. In order to cope up with this problem this paper proposes a relational model to store FSM models and retrieve for service composition.
منابع مشابه
Reasoning in Resource-Constrained Environments: a Matchmaking Engine over Relational Knowledge Bases
We present a framework for logic-based matchmaking on ALN ABoxes stored in a relational database. The proposed approach allows both non-standard reasoning and subsumption check be performed only via standard SQL queries. Main contribution is in the SQL implementation of the following features: (i) compliance with four match classes (i.e., exact, full, partial and potential); (ii) rank computati...
متن کاملThe Web of Life
The Web of Life (www.web-of-life.es) provides a graphical user interface, based on Google Maps, for easily visualizing and down-loading data on ecological networks of species interactions. It is designed and implemented in a relational database management system, allowing sophisticated and user-friendly searching across networks. Users can access the database by any web browser using a variety ...
متن کاملDecision Tables: Scalable Classification Exploring RDBMS Capabilities
In this paper, we report our success in building efficient scalable classifiers in the form of decision tables by exploring capabilities of modern relational database management systems. In addition to high classification accuracy, the unique features of the approach include its high training speed, linear scalability, and simplicity in implementation. More importantly, the major computation re...
متن کاملOxone: A Scalable Solution for Detecting Superior Quality Deltas on Ordered Large XML Documents
Recently, a number of relational-based approaches for detecting the changes to XML data have been proposed to address the scalability problem of main memory-based approaches (e.g., X-Diff, XyDiff). These approaches store the XML documents in the relational database and issue SQL queries (whenever appropriate) to detect the changes. In this paper, we propose a relational-based ordered XML change...
متن کاملInductive Logic Programming meets Relational Databases: An Application to Statistical Relational Learning
With the increasing amount of relational data, scalable approaches to faithfully model this data have become increasingly important. Statistical Relational Learning (SRL) approaches have been developed to learn in presence of noisy relational data by combining probability theory with first order logic. However most learning approaches for these models do not scale well to large datasets. While ...
متن کامل